Fuzzy Detour Boundary Vertices in Fuzzy Graphs
نویسنده
چکیده
A vertex v in a connected fuzzy graph G is a fuzzy detour boundary vertex of a vertex u, if ) , ( ) , ( v u w u Δ ≤ Δ for every fuzzy detour neighbour w of v. This paper is devoted to see how the fuzzy detour boundary vertices are related to fuzzy detour interior vertices. Further, the relation between the fuzzy detour boundary vertices and fuzzy detour eccentric vertices are also studied. Some characterizations are presented for fuzzy detour boundary vertices. Mathematics Subject Classification 2010: 03E72, 05C69, 05C72
منابع مشابه
Strength of strongest dominating sets in fuzzy graphs
A set S of vertices in a graph G=(V,E) is a dominating set ofG if every vertex of V-S is adjacent to some vertex of S.For an integer k≥1, a set S of vertices is a k-step dominating set if any vertex of $G$ is at distance k from somevertex of S. In this paper, using membership values of vertices and edges in fuzzy graphs, we introduce the concepts of strength of strongestdominating set as well a...
متن کاملCERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملIsomorphism of a Fuzzy Graph Using Fuzzy Matrix Equality
In this study we discuss about an application of fuzzy graph isomorphism. If we look two unequal fuzzy matrices on undirected fuzzy graphs, we cannot say either the fuzzy graphs of theses fuzzy matrices are isomorphic or not isomorphic. It is because two fuzzy matrices may look different even if the fuzzy graphs are isomorphic. In this study, by using the algorithm for fuzzy graph isomorphism i...
متن کاملLaplacian Energy of a Fuzzy Graph
A concept related to the spectrum of a graph is that of energy. The energy E(G) of a graph G is equal to the sum of the absolute values of the eigenvalues of the adjacency matrix of G . The Laplacian energy of a graph G is equal to the sum of distances of the Laplacian eigenvalues of G and the average degree d(G) of G. In this paper we introduce the concept of Laplacian energy of fuzzy graphs. ...
متن کامل